Counting homomorphisms onto finite solvable groups
نویسندگان
چکیده
We present a method for computing the number of epimorphisms from a finitely presented group G to a finite solvable group Γ, which generalizes a formula of Gaschütz. Key to this approach are the degree 1 and 2 cohomology groups of G, with certain twisted coefficients. As an application, we count low-index subgroups of G. We also investigate the finite solvable quotients of the Baumslag-Solitar groups, the Baumslag parafree groups, and the Artin braid groups.
منابع مشابه
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
The Counting Constraint Satisfaction Problem (#CSP) can be expressed as follows: given a set of variables, a set of values that can be taken by the variables, and a set of constraints specifying some restrictions on the values that can be taken simultaneously by some variables, determine the number of assignments of values to variables that satisfy all the constraints. The #CSP provides a gener...
متن کاملMTS 311 COURSE TITLE - Groups and Rings
COURSE CONTENT: Groups, Examples of groups, Some elementary properties of groups, Subgroups, Cyclic groups, Cosets and Langrange’s theorem, Normal subgroups and Quotient groups, Homomorphisms, The Isomorphism Theorems, Group Actions, orbits and stabilizers, Conjugacy, Class equation of a finite group, Cauchy’s Theorem, The structure of p-groups, The Sylow’s theorems, Some applications of Sylow’...
متن کاملSome connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups
Let $G$ be a finite group. We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$. In this paper we characterize solvable groups $G$ in which the derived covering number is finite.
متن کاملCounting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
We present a framework for the complexity classification of parameterized counting problems that can be formulated as the summation over the numbers of homomorphisms from small pattern graphs H1, . . . ,H` to a big host graph G with the restriction that the coefficients correspond to evaluations of the Möbius function over the lattice of a graphic matroid. This generalizes the idea of Curticape...
متن کاملA Subgroup Theorem for Free Products of Pro-Finite Groups
The notion of a free product of pro-finite groups has some important applications in the theory of algebraic number fields (see [3]). In this connection, it is interesting to get some knowledge about the subgroups of such a free product. The aim of this paper is to show a theorem for the open subgroups of a free pro-finite product, which is an analog of Kurosh’s wellknown subgroup theorem for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004